Improved random redundant iterative HDPC decoding
نویسندگان
چکیده
منابع مشابه
Random Edge-Local Complementation With Applications to Iterative Decoding of HDPC Codes
This paper describes the application of edge-local complementation (ELC), defined for a simple bipartite graph, to a Tanner graph associated with a binary linear code, C. From a code perspective, various properties of ELC are described and discussed, mainly the special case of isomorphic ELC operations and the relationship to the automorphism group of the code, Aut(C), as well as the generaliza...
متن کاملOn Iterative Decoding of HDPC Codes Using Weight-Bounding Graph Operations
In this paper, we extend our work on iterative softinput soft-output (SISO) decoding of high density parity check (HDPC) codes. Edge-local complementation (ELC) is a graph operation which can be used to give structural diversity during decoding with the sum-product algorithm (SPA). We describe the specific subgraphs required for ELC to not increase the weight of the Tanner graph beyond a specif...
متن کاملAn Iterative Decoding Method of Updating Redundant Likelihood Information
This paper presents a novel decoding algorithm for turbo codes, in which the likelihood values for redundant parts are updated in order for those values to become more reliable. A criterion for updating the redundant likelihood values is proposed, which is based on the comparisons of the channel values with the re-generated values by the soft-input and soft-output encoders. It is shown that the...
متن کاملIterative Source-Channel Decoding: Design of Redundant Index Assignments
The exploitation of the residual redundancy of source codec parameters by using the Turbo principle is known as iterative source-channel decoding (ISCD). The concept of redundant index assignments was proposed as a powerful improvement for ISCD. In this contribution design and optimization guidelines for such redundant index assignments are presented. Commonly, the redundant index assignment is...
متن کاملImproved Iterative Decoding for Perpendicular Magnetic Recording
An algorithm of improving the performance of iterative decoding on perpendicular magnetic recording is presented. This algorithm follows on the authors’ previous works on the parallel and serial concatenated turbo codes and low-density parity-check codes. The application of this algorithm with signalto-noise ratio mismatch technique shows promising results in the presence of media noise. We als...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Communications
سال: 2009
ISSN: 0090-6778
DOI: 10.1109/tcomm.2009.07.070621